Asymptotic Normality of Some Graph Sequences
نویسندگان
چکیده
منابع مشابه
Asymptotic Normality of Some Graph Sequences
For a simple finite graph G denote by { G k } the number of ways of partitioning the vertex set of G into k non-empty independent sets (that is, into classes that span no edges of G). If En is the graph on n vertices with no edges then { En k } coincides with { n k } , the ordinary Stirling number of the second kind, and so we refer to { G k } as a graph Stirling number. Harper showed that the ...
متن کاملAsymptotic Normality of Some Graph-Related Statistics
Petrovskaya and Leontovich (1982) proved a central limit theorem for sums of dependent random variables indexed by a graph. We apply this theorem to obtain asymptotic normality for the number of local maxima of a random function on certain graphs and for the number of edges having the same color at both endpoints in randomly colored graphs. We briefly motivate these problems, and conclude with ...
متن کاملAsymptotic Normality of Graph Statistics
Various types of graph statistics for Bernoulli graphs are represented as numerators of incomplete U-statistics. Asymptotic normality of these statistics is proved for Bernoulli graphs in which the edge probability is constant. In addition it is shown that subgraph counts asymptotically are linear functions of the number of edges in the graph. AMS Subject Classification: Primary 05C99; Secondar...
متن کاملNormality of semigroups with some links to graph theory
This is an expository article whose main aim is to introduce nor~nal affine semigroups and its links with other areas such as graph tlleory, linear programming and polyhedral geometry. As an application we derive the classical and generalized ~narriage theorems. 1 Introduction Let A = (a i j) be an integral matrix of order n x q with nonzero distinct columns and let A = {vl,. .. ,v,) be the set...
متن کاملAsymptotic Modularity of Some Graph Classes
Modularity has been introduced as a quality measure for graph partitioning. It has received considerable attention in several disciplines, especially complex systems. In order to better understand this measure from a graph theoretical point of view, we study the modularity of a variety of graph classes. We first consider simple graph classes such as tori and hypercubes. We show that these regul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2015
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-015-1596-4